Model Limitation and Matching Coefficients (MLMC): A new algorithm for feature matching

نویسندگان

  • GAO Feng
  • WEN Gong-jian
  • LU Huan-zhang
چکیده

-In most algorithms for feature matching, people firstly construct a similarity measure function, then find the optimal solution using iterative methods, along with which the optimal matching matrix and transformation model parameters are gained. The selection of the initial iterative value is a key of the whole algorithm, because it influences the speed of the convergence and determines whether the algorithm can converge to the real value or not. This paper proposes an algorithm combining model limitation and similarity information for computing initial iterative value. The introduction of model limitation and new version for computing matching coefficients can overcome the problem of mismatching caused by the same or similar objects and ensure to get a good initial value. Experiment results show that the proposed algorithm is effective and potent. Index Terms Image registration, feature matching, model limitation, similarity information, matching coefficient.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm for Color Matching of Textiles With Elimination of Limitation on Primaries

The proposed algorithm suggests a new method for determination of K/S value of primaries based on linear least Squares Technique. By applying the matrix pseudoinverse, a modification is introduced to eliminate the limitation on the numbers of applied dyes in one – constant Kubelka-Munk theory. The selection of dyes for tristimulus matching are also done on the basis of the initial spectrophotom...

متن کامل

An Algorithm for Color Matching of Textiles With Elimination of Limitation on Primaries

The proposed algorithm suggests a new method for determination of K/S value of primaries based on linear least Squares Technique. By applying the matrix pseudoinverse, a modification is introduced to eliminate the limitation on the numbers of applied dyes in one – constant Kubelka-Munk theory. The selection of dyes for tristimulus matching are also done on the basis of the initial spectrophotom...

متن کامل

A New RSTB Invariant Image Template Matching Based on Log-Spectrum and Modified ICA

Template matching is a widely used technique in many of image processing and machine vision applications. In this paper we propose a new as well as a fast and reliable template matching algorithm which is invariant to Rotation, Scale, Translation and Brightness (RSTB) changes. For this purpose, we adopt the idea of ring projection transform (RPT) of image. In the proposed algorithm, two novel s...

متن کامل

Image Steganalysis Based on Co-Occurrences of Integer Wavelet Coefficients

We present a steganalysis scheme for LSB matching steganography based on feature vectors extracted from integer wavelet transform (IWT). In integer wavelet decomposition of an image, the coefficients will be integer, so we can calculate co-occurrence matrix of them without rounding the coefficients. Before calculation of co-occurrence matrices, we clip some of the most significant bitplanes of ...

متن کامل

Fractured Reservoirs History Matching based on Proxy Model and Intelligent Optimization Algorithms

   In this paper, a new robust approach based on Least Square Support Vector Machine (LSSVM) as a proxy model is used for an automatic fractured reservoir history matching. The proxy model is made to model the history match objective function (mismatch values) based on the history data of the field. This model is then used to minimize the objective function through Particle Swarm Optimization (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010